Prioric games and minimal degrees below $0^{(1)}$
نویسندگان
چکیده
منابع مشابه
Jumps of Minimal Degrees below 0 0
We show that there is a degree a REA in and low over 0 0 such that no minimal degree below 0 0 jumps to a degree above a. We also show that every nonlow r.e. degree bounds a nonlow minimal degree.
متن کاملThe Turing Degrees below generics and randoms
If x0 and x1 are both generic, the theories of the degrees below x0 and x1 are the same. The same is true if both are random. We show that the n-genericity or n-randomness of x do not su¢ ce to guarantee that the degrees below x have these common theories. We also show that these two theories (for generics and randoms) are di¤erent. These results answer questions of Jockusch as well as Barmpali...
متن کاملDegrees which do not bound minimal degrees
The high/low hierarchy respects the ordering of degrees, and so we can expect to find properties of order which are possessed by all degrees in a given hierarchy class. Such properties can also be found for classes of the generalized high/low hierarchy even though that hierarchy does not respect the ordering of the degrees. For example, Jockusch and Posner [4], extending a result of Cooper [l],...
متن کامل1-Generic Degrees Bounding Minimal Degrees Revisited
We show that over the base system P− + Σ2-bounding, the existence of a 1-generic degree < 0′′ bounding a minimal degree is equivalent to Σ2-induction.
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1974
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-82-3-217-237